Pairings on Jacobians of Hyperelliptic Curves

نویسنده

  • Christian Robenhagen Ravnshøj
چکیده

Consider the Jacobian of a hyperelliptic genus two curve de ned over a nite eld. Under certain restrictions on the endomorphism ring of the Jacobian, we give an explicit description of all non-degenerate, bilinear, anti-symmetric and Galois-invariant pairings on the Jacobian. From this description it follows that no such pairing can be computed more e ciently than the Weil pairing. To establish this result, we need an explicit description of the representation of the Frobenius endomorphism on the `-torsion subgroup of the Jacobian. This description is given. In particular, we show that if the characteristic polynomial of the Frobenius endomorphism splits into linear factors modulo `, then the Frobenius is diagonalizable. Finally, under the restriction that the Frobenius element is an element of a certain subring of the endomorphism ring, we prove that if the characteristic polynomial of the Frobenius endomorphism splits into linear factors modulo `, then the embedding degree and the total embedding degree of the Jacobian with respect to ` are the same number.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates

In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants such as the Eta and Ate pairings on the Jacobians of (hyper-)elliptic curves. In this paper, we consider the use of projective coordinates for ...

متن کامل

Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves

We describe the use of explicit isogenies to reduce Discrete Logarithm Problems (DLPs) on Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, which are vulnerable to faster index calculus attacks. We provide algorithms which compute an isogeny with kernel isomorphic to (Z/2Z) for any hyperelliptic genus 3 curve. These algorithms provide a rational isogeny...

متن کامل

Decomposing Jacobians of Hyperelliptic Curves

Many interesting questions can be asked about the decomposition of Jacobians of curves. For instance, we may want to know which curves have completely decomposable Jacobians (Jacobians which are the product of g elliptic curves) [4]. We may ask about number theoretic properties of the elliptic curves that show up in the decomposition of Jacobians of curves [2]. We would also like to know how ma...

متن کامل

Hyperelliptic Pairings

We survey recent research on pairings on hyperelliptic curves and present a comparison of the performance characteristics of pairings on elliptic curves and hyperelliptic curves. Our analysis indicates that hyperelliptic curves are not more efficient than elliptic curves for general pairing applications.

متن کامل

The average size of the 2-Selmer group of Jacobians of hyperelliptic curves having a rational Weierstrass point

We prove that when all hyperelliptic curves of genus n ≥ 1 having a rational Weierstrass point are ordered by height, the average size of the 2-Selmer group of their Jacobians is equal to 3. It follows that (the limsup of) the average rank of the Mordell-Weil group of their Jacobians is at most 3/2. The method of Chabauty can then be used to obtain an effective bound on the number of rational p...

متن کامل

Pairings on hyperelliptic curves

We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many direction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2007  شماره 

صفحات  -

تاریخ انتشار 2007